VORONOI DIAGRAMS WITHOUT BOUNDING BOXES

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limits of Voronoi Diagrams

Dit proefschrift werd mede mogelijk gemaakt met financiële steun van de Nederlandse Organisatie voor Wetenschappelijk Onderzoek.

متن کامل

Farthest-Polygon Voronoi Diagrams

Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log n) time algorithm to compute it. We also prove a number of structural properties of this ...

متن کامل

Bregman Voronoi Diagrams

The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define various variants of Voronoi diagrams depending on the class of objects, the distance function and the embedding space. In this paper, we investigate a framewo...

متن کامل

Abstract Voronoi diagrams revisited

Voronoi Diagrams Revisited Rolf Klein∗ Elmar Langetepe∗ Zahra Nilforoushan† Abstract Abstract Voronoi diagrams [21] were designed as a unifying concept that should include as many concrete types of diagrams as possible. To ensure that abstract Voronoi diagrams, built from given sets of bisecting curves, are finite graphs, it was required that any two bisecting curves intersect only finitely oft...

متن کامل

Approximate Voronoi Diagrams

A Voronoi diagram of a point set P ⊆ IR is a partition of space into regions, such that the cell of p ∈ P , is V (p, P ) = { x ∣∣∣‖xp‖ ≤‖xp′‖ for all p′ ∈ P }. Vornoi diagrams are a powerful tool and have numerous applications [Aur91]. One problem with Vornoi diagrams is that their descriptive complexity is O(ndd/2e) in IR, in the worst case. See Figure 1 for an exmaple in three dimensions. It ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences

سال: 2015

ISSN: 2194-9050

DOI: 10.5194/isprsannals-ii-2-w2-235-2015